Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
11	Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-03-02 03:52:29 Graph theory Mathematics Graph coloring Degree Graph Eulerian path Ear decomposition NP-complete problems Graph operations Dominating set Incidence coloring
12	Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-01-12 16:30:06 Graph theory NP-complete problems Graph coloring Triangle-free graph Treewidth Independent set Planar graph Line graph Perfect graph Dominating set Clique cover Graph minor
13	TOCS9478_source.nohead.pdf Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-05-14 08:02:16 Graph theory NP-complete problems Circle graph Intersection graph Dominating set Interval graph Chordal graph Graph coloring Treewidth Claw-free graph Clique Planar graph
14	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
15	Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:03 Graph theory NP-complete problems Combinatorial optimization Planar graphs Dominating set Matching Graph coloring Maximal independent set
16	Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004 Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:37:00 Graph theory NP-complete problems Graph Graph coloring Planar graph Dominating set Connectivity Graph operations Planar separator theorem
17	Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg Add to Reading List Source URL: ad-publications.informatik.uni-freiburg.de Language: English - Date: 2013-04-29 10:40:39 NP-complete problems Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Dominating set A* search algorithm Optimization problem Minimum spanning tree Shortest path problem Treewidth Flow network
18	The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2013-04-23 04:25:37 Graph theory NP-complete problems Planar graph Dominating set Vertex Degree Cycle Line graph Bidimensionality
19	Distributed Computing manuscript No. (will be inserted by the editor) Distributed Minimum Dominating Set Approximations in Restricted Families of Graphs Christoph Lenzen · Yvonne-Anne Pignolet · Roger Wattenhofer Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 NP-complete problems Maximal independent set Treewidth Arboricity Dominating set Planar graph Independent set Matching Graph minor Bipartite graph Line graph Planar separator theorem
20	Reconfiguring Independent Sets in Claw-Free Graphs∗ Paul Bonsma† Marcin Kami´ nski‡ Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2015-07-28 10:23:00 NP-complete problems Graph operations Graph coloring Line graph Dominating set Claw-free graph Chordal graph Graph Neighbourhood Independent set Matching Median graph